Generalizing proofs in monadic languages

Bind Induction: Extracting Monadic Programs from Proofs

Container types can be modeled as instances of the Haskell MonadPlus type class which support a fold operation. In this paper we present subclasses that extend the MonadPlus type class to support a membership operator. The laws for the EMonadPlus type class specify how membership behaves with respect to the monad and monad plus operators. Using EMonads we are able write and prove properties of ...

Generic Monadic Constructs for Embedded Languages

We present a library of generic monadic constructs for embedded languages. It is an extension of Syntactic, a Haskell library for defining and processing generic abstract syntax. Until now, Syntactic has been mostly suited to implement languages based on pure, side effect free, expressions. The presented extension allows the pure expressions to also contain controlled side effects, enabling the...

Model Transformations in Decidability Proofs for Monadic Theories

We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (given for example by the restriction to formulas of a certain quantifier rank) and – depending on the fragment – reduces the model under consideration to a simpler one. In the second approach, one applies a global tran...

Generalizing Term Subsumption Languages to Fuzzy Logic

During the past decade, knowledge representation research in AI has generated a class of languages called term subsumption languages (TSL), which is a knowledge representation formalism with a well-defined logic-based semanticsDue to its formal semantics, a term subsumption system can automatically infer the subsumption relationships between concepts defined in the system. However, these system...

Comparative programming languages - generalizing the programming function